#include"priority_queue.h"
#include<iostream>
using namespace std;

void priority_queue_test1()
{
	My_Stl::priority_queue<int,vector<int>,greater<int>> pq;
	pq.push(64);
	pq.push(9);
	pq.push(56);
	pq.push(11);
	pq.push(22);
	pq.push(56);
	pq.push(87);
	pq.push(45);
	pq.push(56);
	pq.push(42);
	pq.push(125);

	while (!pq.empty())
	{
		cout << pq.top() << " ";
		pq.pop();
	}
}

void priority_queue_test2()
{
	vector<int> v = {64,9,56,11,22,56,87,45,56,42,125};
	My_Stl::priority_queue<int, vector<int>, greater<int>> pq(v.begin(),v.end());
	while (!pq.empty())
	{
		cout << pq.top() << " ";
		pq.pop();
	}
}

int main()
{
	priority_queue_test2();
	return 0;
}